On signed diagonal flip sequences
نویسندگان
چکیده
منابع مشابه
On signed diagonal flip sequences
Eliahou [1] and Kryuchkov conjectured a proposition that Gravier and Payan [4] proved to be equivalent to the Four Color Theorem. It states that any triangulation of a polygon can be transformed into another triangulation of the same polygon by a sequence of signed diagonal flips. It is well known that any pair of polygonal triangulations are connected by a sequence of (non-signed) diagonal fli...
متن کاملSigned Diagonal Flips
We introduce the notion of signed diagonal flips on signed surface tri-angulations. We then formulate the conjecture that any two triangulations (without interior vertices) of a given polygon may be transformed into each other by a signable sequence of diagonal flips. Finally, we explain how this conjecture implies the four color theorem.
متن کاملSigned Degree Sequences in Signed Bipartite Graphs
A signed bipartite graph is a bipartite graph in which each edge is assigned a positive or a negative sign. Let G(U, V ) be a signed bipartite graph with U = {u1, u2, · · · , up} and V = {v1, v2, · · · , vq} . Then signed degree of ui is sdeg(ui) = di = d + i − d − i , where 1 ≤ i ≤ p and d+i ( d − i ) is the number of positive(negative) edges incident with ui , and signed degree of vj is sdeg(...
متن کاملSigned degree sequences in signed multipartite graphs
A signed k-partite graph (signed multipartite graph) is a k-partite graph in which each edge is assigned a positive or a negative sign. If G(V1, V2, · · · , Vk) is a signed k-partite graph with Vi = {vi1, vi2, · · · , vini}, 1 ≤ i ≤ k, the signed degree of vij is sdeg(vij) = dij = d + ij − d − ij , where 1 ≤ i ≤ k, 1 ≤ j ≤ ni and d + ij(d − ij) is the number of positive (negative) edges inciden...
متن کاملDiagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations
We introduce color-signed permutations to obtain a very explicit combinatorial interpretation of the q-Eulerian identities of Brenti and some generalizations. In particular, we prove an identity involving the golden ratio, which allows us to compute upper bounds on how high a checker can reach in a classical checkerjumping problem, when the rules are relaxed to allow also diagonal jumps.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2011
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2010.12.001